Alternating-Time Temporal Logic in the Calculus of (Co)Inductive Constructions

نویسندگان

  • Dante Zanarini
  • Carlos Daniel Luna
  • Luis Sierra
چکیده

This work presents a complete formalization of Alternatingtime Temporal Logic (ATL) and its semantic model, Concurrent Game Structures (CGS), in the Calculus of (Co)Inductive Constructions, using the logical framework Coq. Unlike standard ATL semantics, temporal operators are formalized in terms of inductive and coinductive types, employing a fixpoint characterization of these operators. The formalization is used to model a concurrent system with an unbounded number of players and states, and to verify some properties expressed as ATL formulas. Unlike automatic techniques, our formal model has no restrictions in the size of the CGS, and arbitrary state predicates can be used as atomic propositions of ATL.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Formalization of CTL* in Calculus of Inductive Constructions

A modular formalization of the branching time temporal logic CTL∗ is presented. Our formalization subsumes prior formalizations of propositional linear temporal logic (PTL) and computation tree logic (CTL). Moreover, the modularity allows to instantiate our formalization for different formal security models. Validity of axioms and soundness of inference rules in axiomatizations of PTL, UB, CTL,...

متن کامل

Contributions à la sémantique de la programmation logique

This work can be split in two parts. First, we present a full formalisation of the semantics of de nite programs, in the calculus of inductive constructions. For this, we describe a formalisation of the proof of rst order terms uni cation obtained from a similar proof dealing with quasi-terms, thus showing in a general setting how partial functions can be considered in a system with total funct...

متن کامل

The Expressive Power of Epistemic $μ$-Calculus

While the μ-calculus notoriously subsumes Alternating-time Temporal Logic (ATL), we show that the epistemic μ-calculus does not subsume ATL with imperfect information (ATLi), for the synchronous perfect-recall semantics. To prove this we first establish that jumping parity tree automata (JTA), a recently introduced extension of alternating parity tree automata, are expressively equivalent to th...

متن کامل

The Expressive Power of Epistemic $\mu$-Calculus

While the μ-calculus notoriously subsumes Alternating-time Temporal Logic (ATL), we show that the epistemic μ-calculus does not subsume ATL with imperfect information (ATLi), for the synchronous perfect-recall semantics. To prove this we first establish that jumping parity tree automata (JTA), a recently introduced extension of alternating parity tree automata, are expressively equivalent to th...

متن کامل

First Steps Towards Cumulative Inductive Types in CIC

We discuss our on-going research on making inductive types cumulative in the predicative calculus of inductive constructions (pCIC) – the logic of the Coq proof assistant. Having inductive types be cumulative alleviates some problems that occur while working with large inductive types, e.g., the category of small categories, in pCIC. We present the pCuIC system which adds cumulativity for induc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012